
/*							*/
/*  Indexed Sequential Access Method			*/
/*  Relational Database Systems, Inc.			*/
/*							*/
/*		Proprietary Data			*/
/*    This document contains proprietary information	*/
/* and trade secrets which are the property of		*/
/* Relational Database Systems, Inc. (RDSI). This	*/
/* document is submitted to recipient in confidence.	*/
/* The information contained herein may not be used,	*/
/* copied or disclosed in whole or in part except as	*/
/* permitted by written agreement signed by an officer	*/
/* of RDSI.						*/
/*							*/

#include "btree.h"

extern char *isversnumber;
extern char *iscopyright;
extern char *isserial;

#ifdef lint
extern int _VOID_;
#endif

#ifndef ISKERNEL
extern int errno;
extern int iserrno;
extern int iserrio;
extern char isstat1;
extern char isstat2;
extern struct item treeitem;
extern short treelev;
extern short treeleaf;
extern short treeflags;
extern struct ifile *filep;
extern struct open *openp;
extern struct dict *dictp;
#endif  /* ISKERNEL */

extern short nfiles;
extern struct ifile *files[NFILES];

extern short nopens;
extern struct open *opens[NOPENS];

extern short nbuffs;
extern struct buff avbuffs;
#ifdef ISALLOC
extern struct buff *buffs;
extern char *buffers;
#else
extern struct buff buffs[NBUFS];
#ifndef ISKERNEL
extern char buffers[NBUFS*NODESIZE];
#endif  /* ISKERNEL */
#endif /* ISALLOC */

#ifdef CREATLOCK
extern struct lock locks;
#endif

#ifdef DRVRLOCK
extern short lkfd;
extern struct liocb liocb;
extern struct lock  locks[NLOCKS];
#endif

#ifndef ISKERNEL
extern char temprecord[RECORDSIZE+4];
#endif

